Max-flow min-cut theorem — In optimization theory, the max flow min cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum capacity which when removed in a specific way from the network causes the… … Wikipedia
Dedekind cut — Dedekind used his cut to construct the irrational, real numbers. In mathematics, a Dedekind cut, named after Richard Dedekind, is a partition of the rationals into two non empty parts A and B, such that all elements of A are less than all… … Wikipedia
Diamond cut — This article is about diamond cut styles. For a broader discussion of decorative diamonds, see Diamond (gemstone). Part of a series on Diamonds Material … Wikipedia
Lackawanna Cut-Off — The westbound Lackawanna Limited comes off the Pequest Fill shortly after the opening of the Lackawanna Cut Off. Taken from the signal tower at the east end of Greendell Siding, this early 1912 photo was used as a template for a Phoebe Snow… … Wikipedia
SAPHIRE — is a probabilistic risk and reliability assessment software tool. SAPHIRE stands for Systems Analysis Programs for Hands on Integrated Reliability Evaluations . The system was developed for the U.S. Nuclear Regulatory Commission (NRC) by the… … Wikipedia
Fault tree analysis — (FTA) is a failure analysis in which an undesired state of a system is analyzed using boolean logic to combine a series of lower level events. This analysis method is mainly used in the field of safety engineering to quantitatively determine the… … Wikipedia
minimalioji sutapčių aibė — statusas Aprobuotas sritis branduolinė sauga apibrėžtis Būtinas ir pakankamas įvykių derinys (pavyzdžiui, bet koks konstrukcijos, sistemos, komponento gedimo, žmogaus klaidos junginys), galintis sukelti branduolinio reaktoriaus šerdies pažeidimą… … Lithuanian dictionary (lietuvių žodynas)
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
Push-relabel maximum flow algorithm — The push relabel algorithm is one of the most efficient algorithms to compute a maximum flow. The general algorithm has O(V^2 E) time complexity, while the implementation with FIFO vertex selection rule has O(V^3) running time, the highest active … Wikipedia
